Centers in inserted graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smallest graphs with distinct singleton centers

An incredible number of centrality indices has been proposed to date (Todeschini & Consonni, 2009). Four of them, however, can be considered prototypical because they operationalize distinct concepts of centrality and together cover the bulk of analyses and empirical uses: degree, closeness, betweenness, and eigenvector centrality. In teaching any mathematical science, it is instructive to cons...

متن کامل

Centers and medians of distance-hereditary graphs

A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. In this paper, we study metric properties of distance-hereditary graphs. In particular, we determine the structures of centers and medians of distance-hereditary and related graphs. The relations between eccentricity, radius, and diameter of such graphs a...

متن کامل

HT-graphs: centers, connected r-domination and Steiner trees

HT-graphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected r-domination and Steiner trees problems are linear or almost linear time solvable in HT-graphs.

متن کامل

Centers of Approximate Spherical Symmetry and Radial Symmetry Graphs

In this paper we propose the possible use of a new type of salient points we call CASS (Centers of Approximate Spherical Symmetry) that are extracted from the Multiscale Area Projection transform described in [GL12]. In particular, we show that it is possible to build graphs joining these points following maximal values of the MAPT (Radial Symmetry Graphs) and that these graphs can be used to e...

متن کامل

Centers of n-fold tensor products of graphs

Formulas for vertex eccentricity and radius for the n-fold tensor product G = ⊗n i=1 Gi of n arbitrary simple graphs Gi are derived. The center of G is characterized as the union of n + 1 vertex sets of form V1 × V2 × · · · × Vn, with Vi ⊆ V (Gi).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2007

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil0702021p